An optimal set-theoretic blind deconvolution scheme based on hybrid steepest descent method
نویسندگان
چکیده
In this paper, we propose a simple set theoretic blind deconvolution scheme based on a recently developed convex projection technique called Hybrid Steepest Descent Methods. The scheme is essentially motivated by Kundur and Hatzinakos’s idea that minimizes a certain cost function uniformly reflecting all a priori information such that (i) nonnegativity of the true image and (ii) support size of the original object. The most remarkable feature of the proposed scheme is that the proposed one can utilize each (II priors information separately from other ones, where some partial informations are treated in a set theoretic sense while the others are incorporated in a cost function to be minimized.
منابع مشابه
A Set-Theoretic Blind Image Deconvolution Based on Hybrid Steepest Descent Method
Recently, Kundur and Hatzinakos showed that a linear restoration filter designed by using the almost obvious a priori knowledge on the original image, such as (i) nonnegativity of the true image and (ii) the smallest rectangle encompassing the original object, can realize a remarkable performance for a blind image deconvolution problem. In this paper, we propose a new set-theoretic blind image ...
متن کاملConstrained Nonlinear Optimal Control via a Hybrid BA-SD
The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...
متن کاملHybrid steepest-descent method with sequential and functional errors in Banach space
Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...
متن کاملGradient-Based Blind Deconvolution with Flexible Approximated Bayesian Estimator
In this paper a new blind deconvolution algorithm as modzjkation of the Bellini ‘s ‘Bussgang ’ is presented. Firstly, a novel version based on stochastic Gradient Steepest Descent error minimization technique isproposed. Then the Bayesian estimator used by Bellini is approximated with a flexible Sigmoid’ parameterized with adjustable amplitude and slope, and a gradient-based technique is propos...
متن کاملBlind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold
In this paper, we propose a Riemannian steepest descent method for solving a blind deconvolution problem. We prove that the proposed algorithm with an appropriate initialization will recover the exact solution with high probability when the number of measurements is, up to log-factors, the information-theoretical minimum scaling. The quotient structure in our formulation yields a simpler penalt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999